A simulation-based optimisation for the stochastic green capacitated p-median problem

نویسندگان

چکیده

Purpose: This paper aims to propose a new model called the stochastic green capacitated p-median problem with simulation-based optimisation approach. An integer linear programming mathematical is built considering total emission produced by vehicles and uncertain parameters including travel cost for vehicle from particular facility customer amount of CO2 emissions produced. We also develop algorithm solving problem.Design/methodology/approach: The authors proposed algorithms solve problem. hybridisation Monte Carlo simulation Variable Neighbourhood Search matheuristic. method are evaluated using instances that available in literature.Findings: Based on results computational experiments, developed approach can obtain interesting results. obtained display problems within short time solutions have good quality (small deviations).Originality/value: To best our knowledge, there no previous literature investigating There two main contributions this paper. First, build taking into account environmental impact. Second, design incorporating VNS-based matheuristic simulation.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Efficient Hybrid Metaheuristic for Capacitated p-Median Problem

Capacitated p-median problem (CPMP) is a well-known facility-location problem, in which p capacitated facility points are selected to satisfy n demand points in such a way that the total assigned demand to each facility does not exceed its capacity. Minimizing the total sum of distances between each demand point and its nearest facility point is the objective of the problem. Developing an effic...

متن کامل

Matheuristics for the capacitated p-median problem

The recent evolution of computers and mathematical programming techniques has provide the development of a new class of algorithms called matheuristics. Associated with an improvement of MIP solvers, many of these methods have been successful applied to solve combinatorial problems. This work presents an approach that hybridizes metaheuristics based on local search and exact algorithms to solve...

متن کامل

A hybrid metaheuristic approach for the capacitated p-median problem

The capacitated p-median problem (CPMP) seeks to obtain the optimal location of p medians considering distances and capacities for the services to be given by each median. This paper presents an efficient hybrid metaheuristic algorithm by combining a proposed cutting-plane neighborhood structure and a tabu search metaheuristic for the CPMP. In the proposed neighborhood structure to move from th...

متن کامل

Clustering Search Heuristic for the Capacitated p -Median Problem

In this paper we present a hybrid heuristic for the capacitated pmedian problem (CPMP). This problem considers a set of n points, each of them with a known demand, the objective consists of finding p medians and assign each point to exactly one median such that the total distance of assigned points to their corresponding medians is minimized, and the a capacity limit on the medians may not be e...

متن کامل

the capacitated hierarchical p-hub median problem considering delivery time

in this paper, a hierarchical p-hub median problem is considered that all the nodes and arcs on the network have limited capacities. proposed model has three-level where the complete network at the top level consists of the central hubs. the second and third levels consist of hub and demand nodes respectively, which are connected through star networks. also, delivery time restriction is taken i...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Industrial Engineering and Management

سال: 2022

ISSN: ['2013-8423', '2013-0953']

DOI: https://doi.org/10.3926/jiem.3813